Cyclic-Cubes: A New Family of Interconnection Networks of Even Fixed-Degrees

We introduce a new family of interconnection networks that are Cayley graphs with xed degrees of any even number greater than or equal to 4. We call the proposed graphs cyclic-cubes because contracting some cycles in such a graph results in a generalized hypercube. These Cayley graphs have optimal fault tolerance and logarithmic diameters. For comparable number of nodes, a cyclic-cube can have a diameter smaller than previously known xed-degree networks. The proposed graphs can adopt an optimum routing algorithm known for one of its sub-families of Cayley graphs. We also show that a graph in the new family has a Hamiltonian cycle, and hence there is an embedding of a ring. Embedding of meshes and hypercubes are also discussed.